BOOLE A System to Compute Boolean Combinations of Sculptured Solids
نویسندگان
چکیده
We present a system to compute Boolean combinations of sculptured solids The surface of each solid is represented as a collection of trimmed and untrimmed spline surfaces and a connectivity graph Based on algorithms for trapezoidation of polygons partitioning of polygons using polygonal chains surface intersection of high degree spline surfaces and ray shooting we compute the boundaries of the resulting solids and its connectivity graph after the Boolean operation This system has been tested on a number of large scale industrial models and it performs well The system can also handle degenerate cases which occur frequently in practice
منابع مشابه
Interactive Boundary Computation of Boolean Combinations of Sculptured Solids
We present algorithms and systems for interactive boundary computation of Boolean combinations of sculptured solids. The algorithm is applicable to all spline solids and computes an accurate boundary representation.To speed up the computation, the algorithm exploits parallelism at all stages. It has been implemented on a multi-processor SGI and takes one second on average per boolean operation ...
متن کاملBOOLE: A Boundary Evaluation System for Boolean Combinations of Sculptured Solids
In this paper we describe a system, BOOLE, that generates the boundary representations (B-reps) of solids given as a CSG expression in the form of trimmed B ezier patches. The systemmakes use of techniques from computational geometry, numerical linear algebra and symbolic computation to generate the B-reps. Given two solids, the system rst computes the intersection curve between the two solids ...
متن کاملE cient representations and techniques for computing B-rep's of CSG models with NURBS primitives
We present e cient and accurate algorithms for Boolean combinations of solids composed of sculptured models. The surface of each solid is represented as a collection of trimmed and untrimmed spline surfaces and a connectivity graph. Based on algorithms for trapezoidation of polygons, partitioning of polygons using polygonal chains, surface intersection of high degree spline surfaces and ray-sho...
متن کاملEecient Representations and Techniques for Computing B-rep's of Csg Models with Nurbs Primitives
We present eecient and accurate algorithms for Boolean combinations of solids composed of sculptured models. The surface of each solid is represented as a collection of trimmed and untrimmed spline surfaces and a connectivity graph. Based on algorithms for trapezoidation of polygons, partitioning of polygons using polygonal chains, surface intersection of high degree spline surfaces and ray-sho...
متن کامل2 Boundary Computation of Csg Models with Nurbs Primitives
We present eecient and accurate algorithms for Boolean combinations of solids composed of sculptured models. The boundary of each solid is represented as a collection of trimmed spline surfaces and a connectivity graph. Based on algorithms for trapezoidation of polygons , partitioning of polygons using polygonal chains, surface intersection of high degree spline surfaces and ray-shooting, the b...
متن کامل